A note on partitions into distinct parts and odd parts
نویسنده
چکیده
Bousquet-Mélou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a well-known result by Euler. We give a different graphical interpretation of the bijection by Sylvester on partitions into distinct parts and partitions into odd parts, and show that the bijection implies the above statement.
منابع مشابه
Observations on the Parity of the Total Number of Parts in Odd–part Partitions
In recent years, numerous functions which count the number of parts of various types of partitions have been studied. In this brief note, we consider the function pto(n) which counts the number of parts in all odd–part partitions of n (or what Chen and Ji recently called the number of rooted partitions of n into odd parts). In particular, we prove a number of results on the parity of pto(n), in...
متن کاملBalanced Partitions
A famous theorem of Euler asserts that there are as many partitions of n into distinct parts as there are partitions into odd parts. We begin by establishing a less well-known companion result, which states that both of these quantities are equal to the number of partitions of n into even parts along with exactly one triangular part. We then introduce the characteristic of a partition, which is...
متن کاملBijections and Congruences for Generalizations of Partition Identities of Euler and Guy
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed, which is closely related to Euler’s famous theorem that the number of partitions of n into odd parts equals the number of partitions of n into distinct parts. We consider extensions of Guy’s result, which naturally l...
متن کاملThe complexity of Euler's integer partition theorem
Euler’s integer partition theorem stating that the number of partitions of an integer into odd integers is equal to the number of partitions into distinct integers ranks 16 in Wells’ list of the most beautiful theorems [17]. In this paper we use the algorithmic method to evaluate the complexity of mathematical statements developed in [3, 4, 5] to show that Euler’s theorem is in class CU,7, the ...
متن کاملExtending a Recent Result of Santos on Partitions into Odd Parts
In a recent note, Santos proved that the number of partitions of n using only odd parts equals the number of partitions of n of the form p1 + p2 + p3 + p4 + . . . such that p1 ≥ p2 ≥ p3 ≥ p4 ≥ · · · ≥ 0 and p1 ≥ 2p2 + p3 + p4 + . . . . Via partition analysis, we extend this result by replacing the last inequality with p1 ≥ k2p2+k3p3+k4p4+. . . , where k2, k3, k4, . . . are nonnegative integers....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999